Computational number theory

Results: 224



#Item
61Cryptography / Lattice points / Post-quantum cryptography / Computational number theory / Linear algebra / Lattice-based cryptography / Lattice problem / Lattice / SWIFFT / Mathematics / Algebra / Abstract algebra

Lattice-based Cryptography Daniele Micciancio∗ Oded Regev† July 22, 2008

Add to Reading List

Source URL: www.cims.nyu.edu

Language: English - Date: 2008-07-22 12:40:02
62Algebraic number theory / Integer factorization algorithms / Finite fields / Computational hardness assumptions / Logarithms / Discrete logarithm / Quadratic sieve / XTR / Integer factorization / Abstract algebra / Mathematics / Algebra

Main text appears in T. Okamoto (Ed.): Advances in Cryptology – ASIACRYPT 2000, Springer-Verlag LNCS 1976, pp, ISBNAddendum does not appear in proceedings. Security of Cryptosystems Based on Cl

Add to Reading List

Source URL: www.bmoeller.de

Language: English - Date: 2006-01-02 00:24:48
63Applied mathematics / Probability space / Randomized algorithm / Probability / Independence / Expected value / PP / Discrete choice / Theoretical computer science / Probability theory / Computational complexity theory

CS109A Notes for LectureProbability Space Set of points, each with an attached probability (nonnegative, real number), such that the sum of the probabilities is 1.

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:06
64Randomness / Pseudorandomness / Information theory / Computational complexity theory / Pseudorandom number generators / Pseudorandom generator / Leftover hash lemma / Entropy / Fortuna / Theoretical computer science / Applied mathematics / Cryptography

Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions∗ Iftach Haitner† and Omer Reingold‡ and Salil Vadhan§ May 24, 2012 Abstract

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2013-11-27 11:40:21
65Pseudorandomness / Pseudorandom number generators / Computational complexity theory / Algorithmic information theory / Pseudorandom generator / Hard-core predicate / XTR / One-way function / Naor-Reingold Pseudorandom Function / Theoretical computer science / Cryptography / Applied mathematics

An Improved Pseudorandom Generator Based on Hardness of Factoring Nenad Dedi´c Boston University

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2002-08-27 12:28:51
66Primality tests / Analytic number theory / Finite fields / Analysis of algorithms / Computational complexity theory / AKS primality test / Prime number / Randomized algorithm / Time complexity / Mathematics / Abstract algebra / Theoretical computer science

PRIMES is in P Manindra Agrawal Neeraj Kayal ∗ Nitin Saxena Department of Computer Science & Engineering

Add to Reading List

Source URL: math.ucr.edu

Language: English - Date: 2006-05-09 13:08:50
67Contract law / Functions and mappings / Lambda calculus / Combinatorics / Factorial / Number theory / Design by contract / Contract / Futures contract / Software engineering / Mathematics / Computer programming

Computational Contracts Christophe Scholliers ´ Tanter Eric

Add to Reading List

Source URL: www.schemeworkshop.org

Language: English - Date: 2011-10-17 13:23:12
68Randomness / Analysis of algorithms / Probabilistic complexity theory / Design of experiments / Randomized algorithm / Random number generation / Randomization / NL / Adversary model / Theoretical computer science / Computational complexity theory / Applied mathematics

Chapter 6: Randomization Quotation Algorithmic Adventures From Knowledge to Magic

Add to Reading List

Source URL: www.win.tue.nl

Language: English - Date: 2011-10-24 15:11:44
69BLAST / Public domain software / Ordinal number / Normal distribution / Statistics / Spectral theory of ordinary differential equations / Computational phylogenetics / Science / Bioinformatics

BMC Bioinformatics BioMed Central Open Access

Add to Reading List

Source URL: www.genebee.msu.su

Language: English - Date: 2008-11-27 07:15:41
70Lattice points / Cryptography / Computational number theory / Linear algebra / Quadratic forms / Lattice problem / Lattice reduction / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Algebra / Mathematics / Abstract algebra

A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-12-04 01:20:06
UPDATE